{"meta":{"query_hash":"16d2512e059f","filters":{"venue":"Proceedings. 42nd Design Automation Conference, 2005."},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/16d2512e059f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings.+42nd+Design+Automation+Conference%2C+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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04762207711787992,"score_gpt":0.2853582250161972,"score_spread":0.23773614789831726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211201338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030319477,0.000035958587,0.980921,0.00085998833,0.0001167391,0.0014434673,0.000006309135,0.0021504825,0.01143411],"genre_scores_gemma":[0.6045973,0.0000068141685,0.3939374,0.00014060778,0.00027413372,0.00069663866,0.0000021716658,0.00002580102,0.00031914294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727595,0.00006766695,0.000617196,0.0007582483,0.0006339053,0.0006470541],"domain_scores_gemma":[0.9981916,0.00032752968,0.0004339945,0.00032273607,0.0005296492,0.00019447971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013749519,0.00037797037,0.00044993527,0.0003601147,0.00030819172,0.00075533264,0.0011522407,0.0001845918,0.000051200244],"category_scores_gemma":[0.00035258252,0.00036977816,0.00014394225,0.00038947485,0.00007307779,0.0022594782,0.00015571248,0.00018423604,0.00014531193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006779473,0.0004786032,0.000092125316,0.0003331597,0.0001191345,0.000002999257,0.005871352,0.00010298101,0.16525473,0.4693719,0.07616371,0.2821415],"study_design_scores_gemma":[0.00026736848,0.00012344077,0.000064493885,0.0001476718,0.000024411904,0.000022286216,0.000091066635,0.64746505,0.33949658,0.007032319,0.0048464127,0.00041889554],"about_ca_topic_score_codex":0.0000059670383,"about_ca_topic_score_gemma":0.0000014068544,"teacher_disagreement_score":0.64736205,"about_ca_system_score_codex":0.00029477596,"about_ca_system_score_gemma":0.00020589295,"threshold_uncertainty_score":0.9998754},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07432916659593122,"score_gpt":0.2709913418314867,"score_spread":0.1966621752355555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237557932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036491782,0.0001412702,0.99215263,0.00027019976,0.00007265893,0.0009224922,0.000006616984,0.0013990628,0.0013858712],"genre_scores_gemma":[0.5817576,0.000096628355,0.41667435,0.000099001234,0.00013115875,0.00027657617,0.000013131036,0.00006540141,0.00088618556],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978982,0.000067038556,0.00056743313,0.00048259654,0.0003000354,0.00068465783],"domain_scores_gemma":[0.9985765,0.00027431382,0.00019250247,0.00016238158,0.000602917,0.0001913621],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011022855,0.00044810527,0.0005976342,0.0004343051,0.00018541762,0.00023643997,0.00034111727,0.00023892814,0.00021610406],"category_scores_gemma":[0.00011019407,0.00038167293,0.000109234206,0.00047301728,0.000112588124,0.00065763015,0.00002163724,0.00022182903,0.00009765901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076717243,0.00028477295,0.0004872651,0.00068646594,0.0011448459,0.000008855109,0.0037576002,0.018518189,0.8548959,0.030919237,0.010780585,0.07774914],"study_design_scores_gemma":[0.00085260504,0.00013607682,0.0001825694,0.00011563572,0.0001490923,0.000031076725,0.00032634498,0.952678,0.04265051,0.00080807396,0.0015457973,0.00052418374],"about_ca_topic_score_codex":0.000003719588,"about_ca_topic_score_gemma":0.000004908553,"teacher_disagreement_score":0.9341598,"about_ca_system_score_codex":0.000130772,"about_ca_system_score_gemma":0.000117451826,"threshold_uncertainty_score":0.9998635},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Equalization (audio); Filter (signal processing); Algorithm; Computer vision","score_opus":0.03923183387556088,"score_gpt":0.2581216117356575,"score_spread":0.2188897778600966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237811248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072475476,0.00008922686,0.97989273,0.00025056623,0.00014611227,0.00067847205,0.000014365456,0.0010592798,0.017144505],"genre_scores_gemma":[0.5515364,0.00011395908,0.44736984,0.00013487332,0.00017743988,0.0003713842,0.000027195812,0.000044544406,0.00022439338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865496,0.0000139820695,0.000431525,0.00027331174,0.00023880157,0.00038744367],"domain_scores_gemma":[0.9991308,0.00024261037,0.00011311441,0.0001052619,0.00028046392,0.00012774629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034966206,0.0002467583,0.0002531444,0.00018623621,0.00013045919,0.00027594224,0.00019590187,0.00025876143,0.00069597363],"category_scores_gemma":[0.00038313807,0.0002454834,0.0000620565,0.00026749002,0.00003388974,0.00076224026,0.0000159257,0.00012687343,0.0000966693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069195376,0.000098403456,0.00002610933,0.00046967287,0.0001114888,3.7530017e-7,0.0011204532,0.50463575,0.0034610964,0.45811132,0.006449942,0.025446216],"study_design_scores_gemma":[0.0002214843,0.000027510394,0.000052326912,0.00014311286,0.00004968125,0.0000021347082,0.000080718964,0.9689858,0.019373722,0.005178611,0.005573613,0.00031126436],"about_ca_topic_score_codex":9.2274047e-7,"about_ca_topic_score_gemma":0.0000010900047,"teacher_disagreement_score":0.5508116,"about_ca_system_score_codex":0.00012063044,"about_ca_system_score_gemma":0.000053973432,"threshold_uncertainty_score":0.99999976},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040639984663566754,"score_gpt":0.27470770246718795,"score_spread":0.2340677178036212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239560685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014754994,0.00012705171,0.9556574,0.00096463406,0.00039940377,0.0006291843,0.00000246625,0.0012471434,0.026217697],"genre_scores_gemma":[0.4382619,0.000015228381,0.5607064,0.00024162157,0.00013767563,0.000075218966,0.000003727744,0.000016268375,0.0005419694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710417,0.00007724939,0.00066569634,0.00072669797,0.00076221547,0.00066396745],"domain_scores_gemma":[0.99835724,0.00009285232,0.00029547387,0.0003940628,0.00062294037,0.00023744446],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017664046,0.00034577821,0.00030950006,0.0004212866,0.00035978376,0.0008673813,0.0012040928,0.0002031351,0.00019825324],"category_scores_gemma":[0.0003565718,0.00033278408,0.00008599301,0.00067089574,0.00011408826,0.0014830969,0.00019293473,0.00026431718,0.0008509583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022822036,0.00027316992,0.00023289627,0.00008166729,0.000032248547,0.0000016266154,0.004929539,0.003924532,0.027345149,0.8217582,0.008672047,0.13272609],"study_design_scores_gemma":[0.00033091797,0.00008236955,0.0015887046,0.000047211888,0.0000135594,0.00003592363,0.0001094886,0.9548234,0.030389775,0.0034348813,0.008731784,0.00041202983],"about_ca_topic_score_codex":0.000003960075,"about_ca_topic_score_gemma":0.0000012411235,"teacher_disagreement_score":0.9508988,"about_ca_system_score_codex":0.0002429253,"about_ca_system_score_gemma":0.00025157796,"threshold_uncertainty_score":0.999927},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03145764093773942,"score_gpt":0.28030365232303706,"score_spread":0.24884601138529763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247533534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026424327,0.00008551947,0.9902028,0.00023535136,0.00007941841,0.002079693,0.000008990046,0.0008249484,0.0038408905],"genre_scores_gemma":[0.48307732,0.000012985068,0.5162191,0.000051214127,0.000031588694,0.0003284755,0.00001890301,0.000014125061,0.0002463111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977861,0.00003906914,0.000768864,0.0005186177,0.0005292325,0.00035811667],"domain_scores_gemma":[0.9979907,0.00012107159,0.0006680954,0.00026816703,0.0008382338,0.000113714916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015166104,0.0002706688,0.0004110138,0.0008084688,0.00013482089,0.00050826377,0.0007347475,0.00021656347,0.000008120855],"category_scores_gemma":[0.00019071996,0.00026409404,0.00009677424,0.00095922744,0.00006017622,0.0017572377,0.0000686545,0.00015512198,0.000024835486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019288994,0.0018337282,0.00026336612,0.0021667902,0.00022543149,8.7818256e-7,0.009322869,0.18881847,0.010636789,0.5559953,0.016892996,0.21365054],"study_design_scores_gemma":[0.00059984607,0.00016131111,0.0001918443,0.000064169864,0.00002056213,0.0000119112665,0.000062594125,0.99067086,0.0060460004,0.0011532122,0.000740113,0.00027755342],"about_ca_topic_score_codex":0.0000075438647,"about_ca_topic_score_gemma":6.148862e-7,"teacher_disagreement_score":0.8018524,"about_ca_system_score_codex":0.00014360073,"about_ca_system_score_gemma":0.00027032688,"threshold_uncertainty_score":0.9999811},"labels":[],"label_agreement":null}]}