{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"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":"67ab53ca65d3","filters":{"venue":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)"}},"results":[{"id":"W4251324159","doi":"10.1109/aspdac.2004.1337569","title":"Design diagnosis using Boolean satisfiability","year":2004,"lang":"en","type":"article","venue":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":49,"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":"Boolean satisfiability problem; Computer science; Satisfiability; Maximum satisfiability problem; Boolean function; And-inverter graph; Theoretical computer science; Boolean expression; Algorithm","authors":[{"name":"Alexander Smith","is_ca":true},{"name":"Andreas Veneris","is_ca":true},{"name":"Anastasios Viglas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07978221306230644,"gpt":0.2908238733196982,"spread":0.2110416602573918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003532407,0.001092637,0.0007361984,0.003002521,0.0008203663,0.002273358,0.00163688,0.001504106,0.004108261],"category_scores_gemma":[0.01863059,0.0007089481,0.001587526,0.0019102,0.002526102,0.003788838,0.001899954,0.001805899,0.0006202252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001914876,"about_ca_system_score_gemma":0.001924328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002870973,"about_ca_topic_score_gemma":0.003462374,"domain_scores_codex":[0.9954021,0.001926503,0.0003848369,0.0005510477,0.001466802,0.0002687257],"domain_scores_gemma":[0.9918301,0.006239015,0.0005213242,0.000606801,0.0007122961,0.00009059594],"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.0002590674,0.0001346996,0.002479279,0.001129937,0.000204185,0.0009611184,0.0006092772,0.2037045,0.01074528,0.5225185,0.005875735,0.2513785],"study_design_scores_gemma":[0.00009185263,0.00006014726,0.0001780929,0.000176645,0.0000821643,0.0002588124,0.00009322705,0.4596975,0.006853663,0.5259354,0.006538953,0.00003366939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006788426,0.000582869,0.9863735,0.000961843,0.00006588671,0.0001235248,0.0001323262,0.0005955952,0.00437596],"genre_scores_gemma":[0.3550766,0.00198219,0.6384056,0.0006046574,0.0001983338,0.0004005283,0.0007070958,0.0001575777,0.002467359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004108261,"threshold_uncertainty_score":0.01868141,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J.H. Anderson","is_ca":true},{"name":"F.N. Najm","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02583380112465026,"gpt":0.2363112118964563,"spread":0.2104774107718061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000314608,0.0004041677,0.0003263919,0.0007455741,0.0002209845,0.0005651482,0.0004156184,0.0003746086,0.0007936376],"category_scores_gemma":[0.003283047,0.0003291973,0.0002248535,0.0007768802,0.0002286893,0.0007987908,0.0002948579,0.0004259374,0.0002478533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000856167,"about_ca_system_score_gemma":0.0006590058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004346611,"about_ca_topic_score_gemma":0.003929845,"domain_scores_codex":[0.9994988,0.000110584,0.00002220139,0.0001153634,0.0002211862,0.00003190565],"domain_scores_gemma":[0.9990904,0.00038297,0.0001587773,0.0001734407,0.0001750619,0.0000193173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006032896,0.00001580543,0.002585688,0.00007112822,0.00003311636,0.0001195411,0.00002965105,0.8426709,0.02365368,0.0039372,0.00107001,0.1257529],"study_design_scores_gemma":[0.000002455738,0.00001987524,0.0008087448,0.000005808451,0.000003650767,0.00007863327,0.000004483024,0.9918675,0.004792269,0.001523476,0.0008873129,0.000005834844],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06759961,0.0007099584,0.9288202,0.0001816527,0.00001814656,0.00001784661,0.0001694593,0.001009237,0.00147388],"genre_scores_gemma":[0.8799768,0.0007927445,0.1163925,0.0000530519,0.00003886093,0.00003218758,0.0004157625,0.0001194672,0.002178667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004346611,"threshold_uncertainty_score":0.008642614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234744634","doi":"10.1109/aspdac.2004.1337721","title":"Automatic process migration of datapath hard IP libraries","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 Analog Circuit Testing","field":"Computer Science","cited_by":6,"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":"Datapath; Computer architecture; Computer science; Process (computing); Reusability; Integrated circuit layout; Integrated circuit design; Circuit design; Embedded system; Integrated circuit; Operating system; Software","authors":[{"name":"Fang Fang","is_ca":true},{"name":"Jianwen Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04109458876752357,"gpt":0.2442003730868997,"spread":0.2031057843193761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004448869,0.000495284,0.0002901921,0.0006415329,0.0003562275,0.0006640988,0.0009166953,0.000287721,0.001643047],"category_scores_gemma":[0.001554778,0.0002686467,0.0003520967,0.0003891128,0.0002339281,0.0006652108,0.0007704734,0.0005569163,0.0005574753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005026165,"about_ca_system_score_gemma":0.001014213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009601575,"about_ca_topic_score_gemma":0.001381092,"domain_scores_codex":[0.999683,0.00004556604,0.00002158595,0.00004498791,0.0001397881,0.00006510236],"domain_scores_gemma":[0.9993501,0.000157426,0.0000863578,0.0002212432,0.000158268,0.00002645568],"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.00033334,0.0001991066,0.005719664,0.00024917,0.00003688094,0.0005327506,0.0006147535,0.0484178,0.2804357,0.01267622,0.005948715,0.6448359],"study_design_scores_gemma":[0.0001100568,0.0004213145,0.003912966,0.00004211947,0.00006513198,0.000644474,0.0001858599,0.2941217,0.6409727,0.01079919,0.04867731,0.00004730059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2042691,0.0003231644,0.7757312,0.000157393,0.00004872503,0.0003618792,0.0002076649,0.01248618,0.006414698],"genre_scores_gemma":[0.608299,0.000306181,0.3801427,0.0002058229,0.00002643216,0.0003196128,0.00112183,0.001419552,0.00815879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001643047,"threshold_uncertainty_score":0.005496562,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Noureddine Chabini","is_ca":true},{"name":"Marilyn Wolf","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03005004030058587,"gpt":0.2542369333691397,"spread":0.2241868930685538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002770553,0.0006852226,0.0003276527,0.0005837017,0.0003720385,0.0003713757,0.0007806088,0.0003304979,0.001531271],"category_scores_gemma":[0.0007864577,0.000273132,0.000370851,0.0007756415,0.0003031323,0.000799728,0.0004336421,0.0003938841,0.0003042473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004985316,"about_ca_system_score_gemma":0.0007620734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008767537,"about_ca_topic_score_gemma":0.002578729,"domain_scores_codex":[0.9997193,0.00005407985,0.00001949145,0.00005318286,0.0001194714,0.00003443437],"domain_scores_gemma":[0.9996872,0.0001046738,0.00005097387,0.00008988457,0.00005306858,0.00001423249],"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.0002309851,0.0001522381,0.0007570084,0.0002427951,0.00005231209,0.0001578636,0.0001669376,0.1969456,0.1621433,0.02134808,0.002444707,0.6153582],"study_design_scores_gemma":[0.0001241946,0.000855231,0.001118092,0.00003846398,0.0001230101,0.0004634819,0.00007556097,0.8450131,0.1015347,0.03165167,0.01897432,0.00002824167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0485094,0.0006379874,0.9463938,0.0001936496,0.00003704795,0.00005139872,0.00003870732,0.001225984,0.00291195],"genre_scores_gemma":[0.436751,0.0005382468,0.5588686,0.000200647,0.00005463354,0.0001455213,0.0001054411,0.0001499108,0.003185926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001531271,"threshold_uncertainty_score":0.005122602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253940019","doi":"10.1109/aspdac.2004.1337579","title":"Piecewise quadratic waveform matching with successive chord iteration","year":2004,"lang":"en","type":"article","venue":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","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":"Waveform; Electronic circuit; Spice; Nonlinear system; Piecewise; Piecewise linear function; Resistive touchscreen; Algorithm; Control theory (sociology); Computer science; Mathematics; Voltage; Electronic engineering; Mathematical analysis; Physics; Electrical engineering; Engineering","authors":[{"name":"Z. Wang","is_ca":true},{"name":"Jianwen Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01934608285274196,"gpt":0.2336516913488803,"spread":0.2143056084961383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003790563,0.0005075669,0.0004172535,0.0004801782,0.0002287576,0.0005308194,0.0007801136,0.0004715684,0.005074239],"category_scores_gemma":[0.001644873,0.000270192,0.0004704507,0.0005580035,0.0003527198,0.0007733786,0.0007876795,0.000686212,0.001026057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005117516,"about_ca_system_score_gemma":0.000635983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002173228,"about_ca_topic_score_gemma":0.001899772,"domain_scores_codex":[0.9997451,0.00005328394,0.00001351223,0.00003715635,0.0001230708,0.00002793331],"domain_scores_gemma":[0.9997233,0.0001013959,0.00002707522,0.00006580768,0.00006978073,0.00001258525],"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.0002030353,0.00005486673,0.0004882572,0.0001273136,0.00003956938,0.0001062932,0.0002023274,0.5769623,0.02813016,0.07712296,0.002917337,0.3136455],"study_design_scores_gemma":[0.000008683281,0.0000240806,0.00003016285,0.000002383925,0.000002252496,0.0000227613,0.000006842405,0.9893643,0.003385922,0.005413405,0.001735526,0.000003806444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006961535,0.00002654564,0.9902053,0.00002654397,0.00001850807,0.00002730311,0.00001834555,0.0005133098,0.002202572],"genre_scores_gemma":[0.2985106,0.00008370691,0.695342,0.00005284446,0.00002162594,0.000144219,0.0001363575,0.0003086857,0.005399942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005074239,"threshold_uncertainty_score":0.01697499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}