{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002994867,0.0007360307,0.0007268697,0.0004553462,0.0007256352,0.000862918,0.001173495,0.0004836796,0.0001032736],"category_scores_gemma":[0.000805969,0.000749694,0.0001707478,0.001061676,0.0004234413,0.002081484,0.000132675,0.0004303348,0.0004784788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005807019,"about_ca_system_score_gemma":0.001187591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001175679,"about_ca_topic_score_gemma":0.000004144725,"domain_scores_codex":[0.9941227,0.00126746,0.001210689,0.001465794,0.0009329047,0.001000383],"domain_scores_gemma":[0.9959829,0.0004032763,0.0007407729,0.001634273,0.0007568998,0.0004818088],"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.0005229674,0.002560402,0.01687473,0.001344181,0.0007802451,0.0002466298,0.1044285,0.2754493,0.1034425,0.1682491,0.006222362,0.3198791],"study_design_scores_gemma":[0.00197213,0.0005314681,0.006713781,0.0003444637,0.00011934,0.0001068323,0.001374889,0.9352224,0.03029687,0.0213849,0.0002769305,0.001655981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02914545,0.0001285662,0.9657448,0.0003133069,0.001240487,0.001617496,0.00002268523,0.0008433034,0.0009439251],"genre_scores_gemma":[0.4912368,0.00004188987,0.5082098,0.00009803329,0.00008872775,0.0001668625,0.00001116949,0.00003537328,0.000111385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6597731,"threshold_uncertainty_score":0.9994954,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006976083,0.0005946499,0.0005772929,0.000354365,0.0002605242,0.000308712,0.0003225683,0.0004191516,0.0001668803],"category_scores_gemma":[0.0002034838,0.0006169266,0.0001533345,0.0003072926,0.0001422488,0.0008599448,0.00001277334,0.0002749666,0.0003958538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002563363,"about_ca_system_score_gemma":0.0001517518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000100889,"about_ca_topic_score_gemma":0.000008633577,"domain_scores_codex":[0.9974059,0.0001357461,0.0008008482,0.0006165305,0.0003436199,0.0006973455],"domain_scores_gemma":[0.9983863,0.0002159119,0.0002186934,0.0005304614,0.0003939141,0.0002547628],"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.0002462298,0.000361642,0.0003804848,0.001678493,0.0005704627,0.00003067535,0.03184591,0.09731288,0.2554456,0.009654894,0.1070751,0.4953976],"study_design_scores_gemma":[0.0009876029,0.0002045534,0.0001613676,0.0003204531,0.00008833425,0.00003625441,0.000930552,0.9504541,0.04148398,0.002011912,0.00240072,0.0009202184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01995534,0.0003188722,0.9702545,0.0002027495,0.0006156653,0.001512175,0.0001074125,0.001957578,0.005075684],"genre_scores_gemma":[0.8733476,0.0001008654,0.1245233,0.00007773597,0.0002482707,0.0004652624,0.00009558485,0.00009278658,0.001048574],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8533922,"threshold_uncertainty_score":0.9996282,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008357746,0.000518135,0.0006324882,0.0004005196,0.0004102236,0.0007709643,0.0009800483,0.0002652243,0.0001119394],"category_scores_gemma":[0.0003440112,0.0004952901,0.0001040513,0.0008049068,0.0002410365,0.002868563,0.00007583401,0.0002563135,0.0002936524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007787594,"about_ca_system_score_gemma":0.0009027366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003674667,"about_ca_topic_score_gemma":0.00001079351,"domain_scores_codex":[0.9963247,0.0003133272,0.001051357,0.000909105,0.000736926,0.0006645956],"domain_scores_gemma":[0.9972382,0.0002384777,0.0007515639,0.0008933924,0.000586563,0.000291781],"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.00002500858,0.001011288,0.01711345,0.001917278,0.0003826542,0.00007510604,0.09933908,0.008151327,0.05385032,0.02631418,0.0206087,0.7712116],"study_design_scores_gemma":[0.0007588622,0.0002166765,0.006007119,0.0004378415,0.00006356794,0.00004555663,0.001638447,0.9812355,0.006382631,0.002168374,0.0003219384,0.0007234758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1577549,0.0002303116,0.836692,0.0007024039,0.000477068,0.0008002883,0.00004944921,0.0009846782,0.002308859],"genre_scores_gemma":[0.9507059,0.00002859273,0.0481297,0.0001485698,0.0001785204,0.0000805522,0.00006807759,0.00003425732,0.0006258066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9730842,"threshold_uncertainty_score":0.9997499,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006287147,0.0006268504,0.0006043707,0.0005171618,0.0002310351,0.0005530262,0.0003305239,0.0005158731,0.00005447747],"category_scores_gemma":[0.00007151787,0.0006787948,0.0001341349,0.0003234599,0.000195579,0.001194637,0.00001750166,0.0003314189,0.00009323563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005386821,"about_ca_system_score_gemma":0.0003123574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002314887,"about_ca_topic_score_gemma":0.000003499612,"domain_scores_codex":[0.99706,0.0001356299,0.0008332793,0.0008048876,0.0003545585,0.0008116736],"domain_scores_gemma":[0.9986644,0.00008273079,0.0001994772,0.0005513154,0.0002135728,0.000288535],"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.0004252582,0.001271764,0.002174191,0.001698583,0.0004612546,0.0001132199,0.03228829,0.404397,0.5005406,0.002897582,0.001690066,0.05204226],"study_design_scores_gemma":[0.002733681,0.0006159886,0.001621949,0.0004013183,0.000100165,0.000117435,0.002498776,0.9770378,0.01120982,0.002060163,0.00004405633,0.00155886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1324349,0.0001497882,0.8627335,0.00001806572,0.0003551877,0.001667677,0.0001346527,0.001263159,0.001243094],"genre_scores_gemma":[0.9288893,0.00006059498,0.06998757,0.00001718219,0.00007694426,0.0003906054,0.0003342037,0.0001101896,0.0001334436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7964544,"threshold_uncertainty_score":0.9995663,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003160486,0.0005833241,0.0005258694,0.000221214,0.0005921678,0.0006048001,0.0002362358,0.0001904155,0.0004037421],"category_scores_gemma":[0.00001541891,0.0004923264,0.0001233913,0.0003927813,0.0001756227,0.001043387,0.00002550354,0.0003856223,0.0003113359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001273307,"about_ca_system_score_gemma":0.0004757467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001380773,"about_ca_topic_score_gemma":0.00001083221,"domain_scores_codex":[0.99725,0.0001742362,0.0006906146,0.0007566582,0.0004913068,0.000637217],"domain_scores_gemma":[0.9982219,0.00007797525,0.000495901,0.0004600146,0.0004027815,0.0003414334],"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.001717523,0.002630372,0.01323026,0.0009486953,0.001847644,0.0001842116,0.1275718,0.4788533,0.0714143,0.1233656,0.009940945,0.1682954],"study_design_scores_gemma":[0.0124518,0.001549359,0.00353106,0.002016542,0.0006508975,0.0001413344,0.0296786,0.8893661,0.01952012,0.03524456,0.001025601,0.004824053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2512299,0.00003711234,0.7416278,0.0004071252,0.0005757317,0.0009855157,0.00004410591,0.0002525768,0.004840211],"genre_scores_gemma":[0.9891728,0.00001481441,0.007751248,0.00009086625,0.00054748,0.0001714693,0.0002043385,0.00005790189,0.001989112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7379429,"threshold_uncertainty_score":0.9997528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}