{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001810834,0.0003927168,0.00052259,0.0003372042,0.0003056985,0.0005386045,0.001290026,0.0002619237,0.00002907672],"category_scores_gemma":[0.0003880589,0.0003105382,0.0001391378,0.0003400255,0.0001757313,0.001472152,0.0001833582,0.0001931958,0.00002847758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001446849,"about_ca_system_score_gemma":0.0002260712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001072144,"about_ca_topic_score_gemma":0.000003633171,"domain_scores_codex":[0.9972078,0.0000742738,0.0008725711,0.000691535,0.0005706784,0.0005831318],"domain_scores_gemma":[0.9975806,0.0002146565,0.0008982252,0.0004463548,0.0007235348,0.0001365837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003213798,0.000609574,0.002077081,0.001702761,0.0004458288,0.000001043994,0.02325809,0.0001396994,0.1244936,0.6071327,0.1581357,0.08168249],"study_design_scores_gemma":[0.001458685,0.0003270949,0.002845604,0.001758957,0.0002226845,0.00009809418,0.003618971,0.4743777,0.4761154,0.0329673,0.004701237,0.001508249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01233341,0.0001183322,0.9720211,0.005092646,0.0002303474,0.002290504,0.00003237637,0.0007435486,0.007137711],"genre_scores_gemma":[0.8111866,0.00001719263,0.1837202,0.00008835478,0.0001014594,0.0004101202,0.00000259307,0.00002960084,0.004443979],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7988532,"threshold_uncertainty_score":0.9999347,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002144781,0.0002006626,0.0003079752,0.0003247792,0.0001545082,0.0001772532,0.000429972,0.0001441936,0.00001497792],"category_scores_gemma":[0.0003867075,0.0001618676,0.00004818548,0.0003705457,0.0001605491,0.001261675,0.000127105,0.0003023162,0.000005528458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005556765,"about_ca_system_score_gemma":0.00009205347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008646023,"about_ca_topic_score_gemma":0.000003070837,"domain_scores_codex":[0.9982795,0.0001113655,0.0005913111,0.000358477,0.0003654745,0.000293916],"domain_scores_gemma":[0.9989436,0.00009687664,0.0004670169,0.0001690635,0.00024874,0.00007469451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001494479,0.0003042846,0.02829142,0.0005075338,0.00008760068,6.196341e-7,0.1032746,0.0009956037,0.3868757,0.2428361,0.0007453691,0.2359318],"study_design_scores_gemma":[0.0006529806,0.0001079814,0.03630347,0.0004046456,0.00002913414,0.00001860243,0.006368442,0.9015025,0.0513113,0.002590961,0.0003961611,0.0003138658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5826287,0.0001865531,0.4083432,0.000867684,0.0001254921,0.0007960916,0.000003288381,0.0001795048,0.006869473],"genre_scores_gemma":[0.765839,0.00004545389,0.2336916,0.00001589528,0.0000208278,0.00002026848,0.000001134759,0.00000867272,0.0003571499],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9005069,"threshold_uncertainty_score":0.6600771,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001262529,0.0003312386,0.0003882288,0.0002508683,0.0005069559,0.0004234268,0.00080121,0.0001842751,0.00004374718],"category_scores_gemma":[0.0001990353,0.0002629664,0.0001707337,0.0003219826,0.0002204019,0.00085766,0.00009509282,0.0002656867,0.00001898528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006938336,"about_ca_system_score_gemma":0.0003104424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003197001,"about_ca_topic_score_gemma":0.000002780969,"domain_scores_codex":[0.997495,0.00005074112,0.000637871,0.0006233359,0.0005726421,0.0006204185],"domain_scores_gemma":[0.9985811,0.0002039615,0.0002836154,0.0002589287,0.0004517896,0.0002205694],"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.00009743556,0.0007542061,0.009328759,0.0007195713,0.0004102951,0.000002330469,0.01746442,0.0009126198,0.08975352,0.5376837,0.04066837,0.3022047],"study_design_scores_gemma":[0.003818203,0.0004587762,0.02849984,0.0008114267,0.0002478678,0.0001846809,0.002669164,0.8952001,0.02745828,0.02863985,0.01029788,0.00171393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01265443,0.00008640191,0.9744867,0.003013541,0.0001787923,0.0008503227,0.00002986431,0.000285854,0.008414102],"genre_scores_gemma":[0.9613386,0.00001246242,0.034974,0.0001430873,0.0002115917,0.00009179523,0.000005640414,0.00002367875,0.003199136],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9486842,"threshold_uncertainty_score":0.9999822,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008330579,0.0003081545,0.0003808768,0.0001958124,0.0003344822,0.0004420937,0.0007138398,0.0001822225,0.00002221764],"category_scores_gemma":[0.0001469903,0.0002371763,0.00007661333,0.0003417656,0.0001836488,0.0006667887,0.0002522125,0.0002090407,0.0000132797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000441756,"about_ca_system_score_gemma":0.0001098987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002606372,"about_ca_topic_score_gemma":4.77835e-7,"domain_scores_codex":[0.9980137,0.00005901094,0.0005455024,0.0005266928,0.0004038713,0.0004512167],"domain_scores_gemma":[0.9986032,0.00009405226,0.000517904,0.000263809,0.0003386752,0.0001824136],"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.0003592444,0.001380999,0.02371062,0.0008772005,0.0006310123,0.000006774865,0.03033996,0.07723159,0.009825999,0.6841151,0.1026942,0.06882738],"study_design_scores_gemma":[0.0006113579,0.00007685197,0.002926684,0.0001201604,0.00003236438,0.00002149296,0.0004076546,0.9846091,0.001567986,0.00706264,0.002202181,0.0003615275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01107098,0.0002523677,0.9805446,0.00268778,0.0000726163,0.0006777846,0.00001488824,0.0006778666,0.004001155],"genre_scores_gemma":[0.8409752,0.0000827473,0.1579152,0.0001003037,0.0000457262,0.00002793383,0.000004041428,0.00001281225,0.0008359782],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9073775,"threshold_uncertainty_score":0.967177,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002386276,0.0003108172,0.0003355045,0.0003089716,0.0003754945,0.0005379642,0.001105296,0.0001784849,0.00008998333],"category_scores_gemma":[0.0002478188,0.0002610113,0.00008932871,0.0005419626,0.0001381543,0.001850382,0.0001608612,0.0003093481,0.000051009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001233646,"about_ca_system_score_gemma":0.0002285272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000766517,"about_ca_topic_score_gemma":8.712211e-7,"domain_scores_codex":[0.9974741,0.0000732546,0.0006844465,0.0006257402,0.0006210156,0.0005214862],"domain_scores_gemma":[0.9980882,0.00009162487,0.0007833485,0.0004383065,0.0004368338,0.0001616612],"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.0001621153,0.0005405782,0.005673919,0.0004361559,0.0001481155,9.052559e-7,0.007956433,0.005970001,0.1109874,0.794726,0.005609638,0.06778868],"study_design_scores_gemma":[0.0006755944,0.0000560663,0.002515534,0.0001741622,0.00004615474,0.00001872885,0.0005141205,0.9450998,0.04141209,0.005904802,0.003226158,0.0003567684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01351093,0.00007408054,0.9573721,0.0008672166,0.000332494,0.0007966456,0.000006731195,0.0004541333,0.02658571],"genre_scores_gemma":[0.5624797,0.000009820078,0.4360408,0.00005584896,0.0000798493,0.00005489059,0.000001988827,0.0000155739,0.001261536],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9391298,"threshold_uncertainty_score":0.9999842,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007964881,0.0004516041,0.0006154079,0.0007499536,0.0002422691,0.0002709785,0.0004056697,0.000232024,0.0002612915],"category_scores_gemma":[0.00004744624,0.0003694452,0.000149435,0.0009520361,0.000215506,0.0008379363,0.00006885907,0.0003229662,0.0000457795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008108628,"about_ca_system_score_gemma":0.00004932774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003583891,"about_ca_topic_score_gemma":0.000005624082,"domain_scores_codex":[0.9977112,0.00003292631,0.0006728365,0.0004682564,0.0005001864,0.0006145606],"domain_scores_gemma":[0.9989538,0.00006174807,0.0003132923,0.0002739454,0.0001837855,0.0002134596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006930733,0.001143105,0.1763203,0.002911998,0.009941282,0.00001275776,0.1151203,0.0337646,0.2749821,0.03488838,0.1480384,0.2021836],"study_design_scores_gemma":[0.002279975,0.0001890109,0.109889,0.0003735658,0.001526046,0.00004492282,0.00562497,0.8093756,0.05602143,0.0006168514,0.01222705,0.001831526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8779151,0.001831736,0.04342772,0.001373236,0.0004242076,0.001250606,0.0001127348,0.00153537,0.07212925],"genre_scores_gemma":[0.9892076,0.0002520474,0.007211636,0.00002846287,0.00007716531,0.00004755742,0.000006776852,0.00004876929,0.003120021],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.775611,"threshold_uncertainty_score":0.9998757,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001985007,0.0003626634,0.0004537847,0.0002331686,0.0005403718,0.0009943527,0.0005563239,0.0002541984,0.00002267284],"category_scores_gemma":[0.0001310052,0.00028154,0.0001318758,0.0002932269,0.0001633679,0.001054847,0.000109307,0.0002264616,0.00000575868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006837283,"about_ca_system_score_gemma":0.0001217086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006349934,"about_ca_topic_score_gemma":0.000003614953,"domain_scores_codex":[0.9976211,0.00008448722,0.0007045172,0.0006376359,0.0003438908,0.0006083568],"domain_scores_gemma":[0.9982406,0.0002019112,0.0006138736,0.0002522198,0.0005198222,0.0001715376],"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.001741034,0.001626265,0.01774694,0.002407772,0.001345703,0.000002823349,0.03445753,0.03887735,0.02766806,0.39887,0.1297608,0.3454957],"study_design_scores_gemma":[0.0009173222,0.0002105424,0.0003440181,0.000275892,0.00004590071,0.00002379964,0.0009485078,0.9815126,0.006185995,0.001349148,0.007837099,0.0003491896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01003161,0.0002428355,0.9850357,0.001205982,0.0003585997,0.001677825,0.00000485416,0.0003041647,0.001138434],"genre_scores_gemma":[0.9188093,0.00003095979,0.07913025,0.00008651442,0.0002047424,0.0002730612,0.000002718895,0.00002594279,0.001436525],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9426352,"threshold_uncertainty_score":0.9999637,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003646486,0.0003473106,0.0004436456,0.000344419,0.0001002661,0.0001042118,0.0003803527,0.000289282,0.0001147342],"category_scores_gemma":[0.00003702705,0.0002543608,0.00006747386,0.0004336853,0.0002215344,0.0004298967,0.00003557066,0.000347516,0.00002986255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007024873,"about_ca_system_score_gemma":0.00006849721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004153012,"about_ca_topic_score_gemma":0.00001599374,"domain_scores_codex":[0.9982415,0.00001726369,0.0005236014,0.0003624253,0.0003037188,0.000551474],"domain_scores_gemma":[0.9993634,0.00004540511,0.0001592748,0.0001771748,0.0001315573,0.0001231658],"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.002045062,0.004524172,0.1994119,0.007515075,0.00312146,0.00004936689,0.1196072,0.02820314,0.2571951,0.06170823,0.01571695,0.3009023],"study_design_scores_gemma":[0.00330134,0.0001807172,0.03453876,0.0007842099,0.0002111301,0.00006431779,0.005778525,0.9049409,0.04224173,0.0007149101,0.006248017,0.0009954565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9381294,0.0009492934,0.02592855,0.001932362,0.0001279847,0.00237864,0.00004036286,0.0009823581,0.02953111],"genre_scores_gemma":[0.9830222,0.0001160975,0.01574585,0.00003754671,0.00003235394,0.000204971,0.000002342887,0.00003906216,0.0007996458],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8767377,"threshold_uncertainty_score":0.9999909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}