{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":8,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":8,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"ea9efcbaf870","filters":{"venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005."}},"results":[{"id":"W4243129105","doi":"10.1109/aspdac.2005.1466217","title":"Scalable interprocedural register allocation for high level synthesis","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Register allocation; Speedup; Scalability; Parallel computing; Relation (database); Branch predictor; Theoretical computer science; Programming language; Compiler","authors":[{"name":"R. Beidas","is_ca":true},{"name":"Jianwen Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03924881455436664,"gpt":0.2464504498197682,"spread":0.2072016352654016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000631044,0.000872681,0.000587637,0.0009538484,0.0004422929,0.0007725813,0.001011281,0.0004548015,0.004697177],"category_scores_gemma":[0.00141997,0.0004666884,0.0006420736,0.000920443,0.0005363837,0.001141925,0.0007672635,0.001245948,0.0009961544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001011722,"about_ca_system_score_gemma":0.00159234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002386936,"about_ca_topic_score_gemma":0.004522896,"domain_scores_codex":[0.9993473,0.0001927433,0.00003397566,0.00009354483,0.0002423963,0.00008999842],"domain_scores_gemma":[0.9991881,0.0003771637,0.00006111374,0.0002565959,0.00008917933,0.00002773856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003032068,0.000126551,0.0006997035,0.0003115579,0.0000640457,0.0001216247,0.0001285328,0.2852862,0.1027934,0.02634558,0.005521491,0.5782981],"study_design_scores_gemma":[0.00005945202,0.0001215256,0.0003052672,0.00002241862,0.00003141937,0.00005965181,0.00002300504,0.9333594,0.04269074,0.01733852,0.005968409,0.00002015276],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01625104,0.0004697556,0.9748531,0.00009794004,0.00002975147,0.0000613444,0.00006041552,0.005657414,0.00251917],"genre_scores_gemma":[0.2247334,0.0003259963,0.7720241,0.00008149409,0.00003715767,0.0001504774,0.0002281675,0.0005525294,0.001866712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004697177,"threshold_uncertainty_score":0.01571363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4256280318","doi":"10.1109/aspdac.2005.1466203","title":"Integration of supercubing and learning in a SAT solver","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Exploit; Solver; Pruning; Computer science; Boolean satisfiability problem; Enhanced Data Rates for GSM Evolution; Point (geometry); Theoretical computer science; Artificial intelligence; Mathematics; Programming language","authors":[{"name":"D. Babic","is_ca":true},{"name":"A.J. Hu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03063839314547008,"gpt":0.2497461399891514,"spread":0.2191077468436813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029601,0.0009354838,0.001360564,0.001141388,0.0007882065,0.001576164,0.002732576,0.001453165,0.003521813],"category_scores_gemma":[0.0134536,0.0006637356,0.000736136,0.001478269,0.001478905,0.002833898,0.003039281,0.002631639,0.0009914968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000987999,"about_ca_system_score_gemma":0.001673987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001896913,"about_ca_topic_score_gemma":0.004055464,"domain_scores_codex":[0.996143,0.001616908,0.0002013535,0.0005926772,0.001159758,0.000286306],"domain_scores_gemma":[0.9908435,0.005640102,0.0004775997,0.001724965,0.001102261,0.0002115814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004307236,0.00055832,0.005715359,0.0003218077,0.0001097486,0.0003912585,0.0003776714,0.2749035,0.01029374,0.08297624,0.004252265,0.6196694],"study_design_scores_gemma":[0.00003350959,0.0001595529,0.0003991029,0.00003067169,0.00003162094,0.000170081,0.00006428429,0.9225723,0.01334187,0.05883799,0.004339774,0.00001928229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05813816,0.0003233918,0.9317817,0.0005409568,0.00004473842,0.0002277764,0.00009322632,0.00177016,0.007079979],"genre_scores_gemma":[0.3674923,0.0002146714,0.6279119,0.0003411393,0.00004089287,0.0002421327,0.0003420602,0.0002593796,0.003155494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003521813,"threshold_uncertainty_score":0.01565468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4231097844","doi":"10.1109/aspdac.2005.1466550","title":"Register-transfer level functional scan for hierarchical designs","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Register-transfer level; Scan chain; Design for testing; Computer science; Abstraction; Testability; Transfer (computing); Shift register; High-level synthesis; Register (sociolinguistics); Logic synthesis; Parallel computing; Computer architecture; Logic gate; Embedded system; Reliability engineering; Algorithm; Integrated circuit; Engineering; Field-programmable gate array","authors":[{"name":"Ho Fai Ko","is_ca":true},{"name":"Qiang Xu","is_ca":true},{"name":"N. Nicolici","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08925124745465288,"gpt":0.2474607164281105,"spread":0.1582094689734576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004780131,0.0003448866,0.0001911153,0.0003560286,0.0002394815,0.0004490814,0.0004738593,0.0003072635,0.00537226],"category_scores_gemma":[0.001550781,0.0001645569,0.0003558366,0.0003814857,0.0005373975,0.0007361433,0.0004751916,0.0005619563,0.0007390984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004826689,"about_ca_system_score_gemma":0.0005203843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008278645,"about_ca_topic_score_gemma":0.002344144,"domain_scores_codex":[0.9996442,0.00009260205,0.00002140909,0.00004565657,0.0001509658,0.00004508705],"domain_scores_gemma":[0.9990546,0.0004152588,0.00009823918,0.0003007825,0.0001100844,0.00002107169],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003555759,0.00006986857,0.002429997,0.000656976,0.00005114775,0.0005430211,0.0003813769,0.2148845,0.1479048,0.2522163,0.003485064,0.3770213],"study_design_scores_gemma":[0.00008452589,0.0009184623,0.001464266,0.0001297465,0.00007500115,0.0006751404,0.0001065414,0.7278408,0.09728756,0.1286843,0.0426808,0.00005288284],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04373771,0.0004341179,0.9430285,0.0001180567,0.00002437538,0.00008265972,0.0001140555,0.001558485,0.0109021],"genre_scores_gemma":[0.6110209,0.0003421933,0.3839407,0.0001638952,0.00003179799,0.0001224639,0.0002740235,0.0001669864,0.003936979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00537226,"threshold_uncertainty_score":0.01797199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4255096096","doi":"10.1109/aspdac.2005.1466524","title":"XTW: a parallel and distributed logic simulator","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Rollback; Computer science; Queue; Scheduling (production processes); Parallel computing; Schedule; Logic simulation; Distributed computing; Discrete event simulation; Logic gate; Real-time computing; Simulation; Computer network; Algorithm; Operating system; Engineering; Database transaction","authors":[{"name":"Qing Xu","is_ca":true},{"name":"C. Tropper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02255839538384482,"gpt":0.2368695683654387,"spread":0.2143111729815939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005374277,0.0005054455,0.0003839989,0.0003920429,0.0002449712,0.0007379108,0.002162536,0.0005204761,0.008162523],"category_scores_gemma":[0.001496098,0.0005112216,0.000497699,0.0004423026,0.0004040158,0.00134777,0.0008182185,0.001013536,0.001053246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005294025,"about_ca_system_score_gemma":0.001301361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002299237,"about_ca_topic_score_gemma":0.00278152,"domain_scores_codex":[0.9996792,0.00008267019,0.0000232806,0.00004264186,0.000140542,0.00003170782],"domain_scores_gemma":[0.9994567,0.0002349531,0.00004816188,0.0001317936,0.00008993578,0.00003851051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003973156,0.0001321827,0.001916717,0.0002893677,0.0001004234,0.0001886196,0.00009951959,0.8682755,0.02110235,0.03272188,0.01214212,0.06263407],"study_design_scores_gemma":[0.00005828106,0.00005694243,0.00009288042,0.000004558986,0.00001256519,0.00003944223,0.000005986574,0.9823602,0.00557184,0.004344194,0.007443691,0.000009425337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04815875,0.0002270801,0.9103658,0.0003256957,0.0001432295,0.0003486574,0.001969166,0.02569188,0.01276983],"genre_scores_gemma":[0.5045209,0.0004998621,0.4735121,0.0003961742,0.00005694274,0.0009843154,0.003809925,0.002017869,0.01420186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008162523,"threshold_uncertainty_score":0.02730638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4230771668","doi":"10.1109/aspdac.2005.1466516","title":"BDD-based two variable sharing extraction","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Binary decision diagram; Computer science; Variable (mathematics); Theoretical computer science; Algorithm; Binary number; Product (mathematics); Exploit; Mathematics; Arithmetic","authors":[{"name":"Danyu Wu","is_ca":true},{"name":"Jianwen Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03509736295451807,"gpt":0.2737155763636108,"spread":0.2386182134090927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009579413,0.0009882881,0.000929605,0.0016069,0.0007007375,0.001127533,0.0009937055,0.0005494941,0.004935847],"category_scores_gemma":[0.003238174,0.0006395775,0.001486681,0.001360618,0.0007983114,0.002085473,0.00181273,0.0009141127,0.0012554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00087102,"about_ca_system_score_gemma":0.001672377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002097241,"about_ca_topic_score_gemma":0.002575389,"domain_scores_codex":[0.9985358,0.0001920895,0.0001384216,0.000278266,0.0007043531,0.000151107],"domain_scores_gemma":[0.9986221,0.0005235519,0.0001026376,0.0003830523,0.0003385009,0.00003023094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003209276,0.0001310979,0.001700026,0.0005525387,0.0001180718,0.0002603079,0.0002402698,0.1426748,0.03660455,0.07506903,0.00461867,0.7377096],"study_design_scores_gemma":[0.0001070922,0.0001303009,0.0005766854,0.0000691253,0.0001374736,0.0003006593,0.0000809837,0.759787,0.1078775,0.09968144,0.03118951,0.00006218836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007191323,0.000100089,0.9888764,0.00004385769,0.00002530781,0.00009988539,0.0001602324,0.001621883,0.001880954],"genre_scores_gemma":[0.1479761,0.0001676438,0.8470536,0.00006013145,0.00001488613,0.0001828479,0.0008783925,0.0003164962,0.003349918],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004935847,"threshold_uncertainty_score":0.0165121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4247631688","doi":"10.1109/aspdac.2005.1466116","title":"Leakage power: trends, analysis and avoidance","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Leakage (economics); Subthreshold conduction; Leakage power; Electronic engineering; Transistor; Electrical engineering; Scaling; Computer science; Circuit design; Voltage; Engineering; Mathematics","authors":[{"name":"D. Blaauw","is_ca":false},{"name":"Anirudh Devgan","is_ca":false},{"name":"Farid N. Najm","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009213849121891968,"gpt":0.1937400157380405,"spread":0.1845261666161486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005855916,0.0008839496,0.0006934052,0.002106088,0.0003168487,0.00257456,0.001085398,0.001244631,0.003739509],"category_scores_gemma":[0.001413629,0.0005573544,0.0005161783,0.003715729,0.0005499788,0.004154105,0.000633874,0.001789569,0.002943838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009514499,"about_ca_system_score_gemma":0.0008111352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001103092,"about_ca_topic_score_gemma":0.001013174,"domain_scores_codex":[0.9994373,0.00005745878,0.00003294983,0.0001079876,0.0003217822,0.00004241337],"domain_scores_gemma":[0.9994345,0.0001838155,0.00006820706,0.00003588926,0.0002557961,0.00002182113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008303425,0.00008411244,0.001928375,0.005191396,0.00007095236,0.0002139203,0.0002542778,0.009071509,0.006664966,0.06422397,0.0636951,0.8485184],"study_design_scores_gemma":[0.000009404837,0.0002807406,0.003718967,0.002595019,0.0000711441,0.001664611,0.0002535112,0.01260854,0.006093565,0.03848289,0.934145,0.0000766448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.005173655,0.9372146,0.0231254,0.00322161,0.001011844,0.000044551,0.0004258891,0.0004829395,0.02929942],"genre_scores_gemma":[0.04624593,0.9096174,0.01620616,0.001734485,0.002367922,0.00008914062,0.000848279,0.0001928655,0.02269792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003739509,"threshold_uncertainty_score":0.01250988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4250137794","doi":"10.1109/aspdac.2005.1466487","title":"Crossbar based design schemes for switch boxes and programmable interconnection networks","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Crossbar switch; Interconnection; Computer science; Routing (electronic design automation); Crossover switch; Field-programmable gate array; Topology (electrical circuits); Network on a chip; Network topology; Parallel computing; Embedded system; Computer architecture; Computer network; Engineering; Electrical engineering; Telecommunications","authors":[{"name":"Hongbing Fan","is_ca":true},{"name":"Yu‐Liang Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02551139114062948,"gpt":0.2310264431836551,"spread":0.2055150520430256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004424457,0.0007302925,0.0002224353,0.0005218288,0.0003081094,0.0008995082,0.000892295,0.0006766507,0.004523293],"category_scores_gemma":[0.0007442914,0.0002922052,0.0003643182,0.000668421,0.0005753584,0.001026878,0.0005174461,0.000857033,0.0009104346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006209878,"about_ca_system_score_gemma":0.0003282949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002007314,"about_ca_topic_score_gemma":0.0003954649,"domain_scores_codex":[0.9996512,0.0000994962,0.00003130894,0.00007699286,0.0001088308,0.00003215858],"domain_scores_gemma":[0.9997296,0.00006729164,0.00005188803,0.00006476083,0.00007453344,0.00001201795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001185729,0.00004771998,0.0002467866,0.0006401575,0.00005344359,0.0002017777,0.0002030417,0.04270162,0.07464257,0.7097129,0.004719782,0.1667117],"study_design_scores_gemma":[0.0001704951,0.0006622136,0.0006185099,0.0003090089,0.0001408481,0.001817236,0.0001318689,0.2333075,0.1181705,0.2445675,0.4000184,0.00008616236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01479308,0.002797872,0.961615,0.0002467363,0.0003803746,0.0001180353,0.00009824118,0.0007253619,0.01922529],"genre_scores_gemma":[0.2982786,0.003302445,0.6776101,0.0005712762,0.0002221573,0.0004583707,0.0002261032,0.0002054031,0.01912551],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004523293,"threshold_uncertainty_score":0.01513195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234808533","doi":"10.1109/aspdac.2005.1466422","title":"A 10Gb/s transmitter with multi-tap FIR pre-emphasis in 0.18μm CMOS technology","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Retiming; Transmitter; CMOS; Backplane; Current-mode logic; Electronic engineering; Finite impulse response; Emphasis (telecommunications); Electrical engineering; Computer science; Engineering; Channel (broadcasting)","authors":[{"name":"Miao Li","is_ca":true},{"name":"T. Kwasniewski","is_ca":true},{"name":"Shoujun Wang","is_ca":false},{"name":"Yuming Tao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01203166929826825,"gpt":0.2071052937979787,"spread":0.1950736244997104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001566497,0.0002274013,0.0001876723,0.0001378017,0.0002303588,0.0002552224,0.0003447667,0.0003005533,0.002289139],"category_scores_gemma":[0.0002221705,0.0001471166,0.0001437293,0.0001357656,0.000123119,0.000311984,0.0001380124,0.0002952263,0.000680083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004493321,"about_ca_system_score_gemma":0.0005413495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001264059,"about_ca_topic_score_gemma":0.001881425,"domain_scores_codex":[0.9998847,0.00001322654,0.000005575891,0.00002345401,0.00004130121,0.00003169798],"domain_scores_gemma":[0.9998945,0.00002370757,0.00002294081,0.000009915923,0.00003257625,0.00001642432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000266709,0.0000732766,0.001586938,0.0001262494,0.00001914495,0.00041316,0.0001724981,0.003935868,0.9601022,0.00245707,0.001021888,0.02982502],"study_design_scores_gemma":[0.0001819868,0.00215261,0.004672926,0.00004707235,0.0001005279,0.001740624,0.00009013278,0.05352201,0.9106142,0.00069626,0.02613349,0.0000482654],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8730919,0.0007550595,0.1118584,0.0004547761,0.0001354158,0.0001395656,0.0002807815,0.002674408,0.01060967],"genre_scores_gemma":[0.8903387,0.0002872922,0.09946129,0.0001071609,0.00002697266,0.00004537527,0.0001257817,0.00003590739,0.009571603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002289139,"threshold_uncertainty_score":0.007657945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}