{"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"},"query_hash":"16d2512e059f","filters":{"venue":"Proceedings. 42nd Design Automation Conference, 2005."}},"results":[{"id":"W4211201338","doi":"10.1109/dac.2005.193848","title":"Incremental retiming for FPGA physical synthesis","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Embedded Systems Design Techniques","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":"Alterra Power (Canada)","funders":"","keywords":"Retiming; Field-programmable gate array; Computer science; Glitch; Stratix; Reset (finance); Floorplan; Parallel computing; Embedded system; Computer hardware; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04762207711787992,"gpt":0.2853582250161972,"spread":0.2377361478983173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001374952,0.0003779704,0.0004499353,0.0003601147,0.0003081917,0.0007553326,0.001152241,0.0001845918,0.00005120024],"category_scores_gemma":[0.0003525825,0.0003697782,0.0001439422,0.0003894749,0.00007307779,0.002259478,0.0001557125,0.000184236,0.0001453119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000294776,"about_ca_system_score_gemma":0.000205893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005967038,"about_ca_topic_score_gemma":0.000001406854,"domain_scores_codex":[0.9972759,0.00006766695,0.000617196,0.0007582483,0.0006339053,0.0006470541],"domain_scores_gemma":[0.9981916,0.0003275297,0.0004339945,0.0003227361,0.0005296492,0.0001944797],"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.00006779473,0.0004786032,0.00009212532,0.0003331597,0.0001191345,0.000002999257,0.005871352,0.000102981,0.1652547,0.4693719,0.07616371,0.2821415],"study_design_scores_gemma":[0.0002673685,0.0001234408,0.00006449388,0.0001476718,0.0000244119,0.00002228622,0.00009106663,0.6474651,0.3394966,0.007032319,0.004846413,0.0004188955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003031948,0.00003595859,0.980921,0.0008599883,0.0001167391,0.001443467,0.000006309135,0.002150482,0.01143411],"genre_scores_gemma":[0.6045973,0.000006814169,0.3939374,0.0001406078,0.0002741337,0.0006966387,0.000002171666,0.00002580102,0.0003191429],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6473621,"threshold_uncertainty_score":0.9998754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4239560685","doi":"10.1109/dac.2005.193910","title":"Efficient SAT solving: beyond supercubes","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Pruning; Computer science; Speedup; Boolean satisfiability problem; Benchmark (surveying); Maximum satisfiability problem; Solver; Theoretical computer science; Boolean function; Algorithm; Programming language; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.04063998466356675,"gpt":0.274707702467188,"spread":0.2340677178036212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001766405,0.0003457782,0.0003095001,0.0004212866,0.0003597838,0.0008673813,0.001204093,0.0002031351,0.0001982532],"category_scores_gemma":[0.0003565718,0.0003327841,0.00008599301,0.0006708957,0.0001140883,0.001483097,0.0001929347,0.0002643172,0.0008509583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002429253,"about_ca_system_score_gemma":0.000251578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003960075,"about_ca_topic_score_gemma":0.000001241124,"domain_scores_codex":[0.9971042,0.00007724939,0.0006656963,0.000726698,0.0007622155,0.0006639675],"domain_scores_gemma":[0.9983572,0.00009285232,0.0002954739,0.0003940628,0.0006229404,0.0002374445],"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.00002282204,0.0002731699,0.0002328963,0.00008166729,0.00003224855,0.000001626615,0.004929539,0.003924532,0.02734515,0.8217582,0.008672047,0.1327261],"study_design_scores_gemma":[0.000330918,0.00008236955,0.001588705,0.00004721189,0.0000135594,0.00003592363,0.0001094886,0.9548234,0.03038977,0.003434881,0.008731784,0.0004120298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01475499,0.0001270517,0.9556574,0.0009646341,0.0003994038,0.0006291843,0.00000246625,0.001247143,0.0262177],"genre_scores_gemma":[0.4382619,0.00001522838,0.5607064,0.0002416216,0.0001376756,0.00007521897,0.000003727744,0.00001626838,0.0005419694],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9508988,"threshold_uncertainty_score":0.999927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237811248","doi":"10.1109/dac.2005.193889","title":"A unified optimization framework for equalization filter synthesis","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":4,"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":"Computer science; Equalization (audio); Filter (signal processing); Algorithm; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.03923183387556088,"gpt":0.2581216117356575,"spread":0.2188897778600966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003496621,0.0002467583,0.0002531444,0.0001862362,0.0001304592,0.0002759422,0.0001959019,0.0002587614,0.0006959736],"category_scores_gemma":[0.0003831381,0.0002454834,0.0000620565,0.00026749,0.00003388974,0.0007622403,0.0000159257,0.0001268734,0.0000966693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001206304,"about_ca_system_score_gemma":0.00005397343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.227405e-7,"about_ca_topic_score_gemma":0.000001090005,"domain_scores_codex":[0.998655,0.00001398207,0.000431525,0.0002733117,0.0002388016,0.0003874437],"domain_scores_gemma":[0.9991308,0.0002426104,0.0001131144,0.0001052619,0.0002804639,0.0001277463],"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.00006919538,0.00009840346,0.00002610933,0.0004696729,0.0001114888,3.753002e-7,0.001120453,0.5046358,0.003461096,0.4581113,0.006449942,0.02544622],"study_design_scores_gemma":[0.0002214843,0.00002751039,0.00005232691,0.0001431129,0.00004968125,0.000002134708,0.00008071896,0.9689858,0.01937372,0.005178611,0.005573613,0.0003112644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007247548,0.00008922686,0.9798927,0.0002505662,0.0001461123,0.000678472,0.00001436546,0.00105928,0.0171445],"genre_scores_gemma":[0.5515364,0.0001139591,0.4473698,0.0001348733,0.0001774399,0.0003713842,0.00002719581,0.00004454441,0.0002243934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5508116,"threshold_uncertainty_score":0.9999998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237557932","doi":"10.1109/dac.2005.193820","title":"Design methodology for wireless nodes with printed antennas","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"University of Colorado Boulder","keywords":"Computer science; Wireless; Antenna (radio); Wireless network; Node (physics); Wi-Fi array; Range (aeronautics); Electronic engineering; Electrical engineering; Computer network; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07432916659593122,"gpt":0.2709913418314867,"spread":0.1966621752355555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001102285,0.0004481053,0.0005976342,0.0004343051,0.0001854176,0.00023644,0.0003411173,0.0002389281,0.0002161041],"category_scores_gemma":[0.0001101941,0.0003816729,0.0001092342,0.0004730173,0.0001125881,0.0006576302,0.00002163724,0.000221829,0.00009765901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000130772,"about_ca_system_score_gemma":0.0001174518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003719588,"about_ca_topic_score_gemma":0.000004908553,"domain_scores_codex":[0.9978982,0.00006703856,0.0005674331,0.0004825965,0.0003000354,0.0006846578],"domain_scores_gemma":[0.9985765,0.0002743138,0.0001925025,0.0001623816,0.000602917,0.0001913621],"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.0007671724,0.0002847729,0.0004872651,0.0006864659,0.001144846,0.000008855109,0.0037576,0.01851819,0.8548959,0.03091924,0.01078058,0.07774914],"study_design_scores_gemma":[0.000852605,0.0001360768,0.0001825694,0.0001156357,0.0001490923,0.00003107672,0.000326345,0.952678,0.04265051,0.000808074,0.001545797,0.0005241837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003649178,0.0001412702,0.9921526,0.0002701998,0.00007265893,0.0009224922,0.000006616984,0.001399063,0.001385871],"genre_scores_gemma":[0.5817576,0.00009662836,0.4166743,0.00009900123,0.0001311588,0.0002765762,0.00001313104,0.00006540141,0.0008861856],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9341598,"threshold_uncertainty_score":0.9998635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4247533534","doi":"10.1109/dac.2005.193932","title":"A non-parametric approach for dynamic range estimation of nonlinear systems","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Blind Source Separation Techniques","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":"Computer science; Datapath; Nonlinear system; Algorithm; Gaussian; Dynamic range; Parametric statistics; Range (aeronautics); Orthonormal basis; High dynamic range; Independent component analysis; Gaussian process; Mathematical optimization; Mathematics; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03145764093773942,"gpt":0.2803036523230371,"spread":0.2488460113852976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00151661,0.0002706688,0.0004110138,0.0008084688,0.0001348209,0.0005082638,0.0007347475,0.0002165635,0.000008120855],"category_scores_gemma":[0.00019072,0.000264094,0.00009677424,0.0009592274,0.00006017622,0.001757238,0.0000686545,0.000155122,0.00002483549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001436007,"about_ca_system_score_gemma":0.0002703269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007543865,"about_ca_topic_score_gemma":6.148862e-7,"domain_scores_codex":[0.9977861,0.00003906914,0.000768864,0.0005186177,0.0005292325,0.0003581167],"domain_scores_gemma":[0.9979907,0.0001210716,0.0006680954,0.000268167,0.0008382338,0.0001137149],"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.0001928899,0.001833728,0.0002633661,0.00216679,0.0002254315,8.781826e-7,0.009322869,0.1888185,0.01063679,0.5559953,0.016893,0.2136505],"study_design_scores_gemma":[0.0005998461,0.0001613111,0.0001918443,0.00006416986,0.00002056213,0.00001191127,0.00006259412,0.9906709,0.006046,0.001153212,0.000740113,0.0002775534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002642433,0.00008551947,0.9902028,0.0002353514,0.00007941841,0.002079693,0.000008990046,0.0008249484,0.00384089],"genre_scores_gemma":[0.4830773,0.00001298507,0.5162191,0.00005121413,0.00003158869,0.0003284755,0.00001890301,0.00001412506,0.0002463111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8018524,"threshold_uncertainty_score":0.9999811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}